Approaching the Slepian-Wolf Limit with LDPC Coset Codes
نویسندگان
چکیده
We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalent to a channel coding problem for a binaryinput symmetric-output channel. With this connection, many classic results in channel coding can be easily translated into the Slepian-Wolf setting. Index Terms Belief propagation, coset codes, density evolution, LDPC, Slepian-Wolf.
منابع مشابه
Density Evolution Technique for LDPC Codes in Slepian-Wolf Coding of Nonuniform Sources
This paper attempts to examine the optimality of LDPC codes for compression of nonuniform source with Slepian-Wolf coding using density evolution technique. The primary goal is to evaluate the performance of LDPC codes with reference to turbo codes (in SF-ISF setup). The appreciable difference between LDPC and turbo codes is also discussed in this paper. The threshold values obtained from the d...
متن کاملDesign of Nested LDGM-LDPC Codes for Compress-and-Forward in Relay Channel
A three terminal relay system with binary erasure channel (BEC) was considered, in which a source forwarded information to a destination with a relay’s ”assistance”. The nested LDGM (Low-density generator-matrix) -LDPC (lowdensity parity-check) was designed to realize Compress-andforward (CF) at the relay. LDGM coding compressed the received signals losslessly and LDPC realized the binning for ...
متن کاملCompression of Correlated Sources Using LDPC Codes
We consider the problem of compressing correlated binary sources when the correlation between sources is defined by a Hidden Markov Model (HMM). Specifically, the HMM describes the correlation pattern, i.e. the modulo-2 addition of the two sources. In this framework, we develop a density evolution analysis of a compression system using irregular LDPC codes as source codes. In order to achieve t...
متن کاملRate-adaptive codes for distributed source coding
Source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical dependencies between source and side information. Two classes of rate-adaptive distributed source codes, both based on Low-Density Parity-Check (LDPC) codes, are developed and their design is studied. Specific realizations are shown to be b...
متن کاملDistributed Joint Source-Channel Coding for arbitrary memoryless correlated sources and Source coding for Markov correlated sources using LDPC codes
In this paper, we give a distributed joint source channel coding scheme for arbitrary correlated sources for arbitrary point in the Slepian-Wolf rate region, and arbitrary link capacities using LDPC codes. We consider the Slepian-Wolf setting of two sources and one destination, with one of the sources derived from the other source by some correlation model known at the decoder. Distributed enco...
متن کامل